翻訳と辞書 |
Fast folding algorithm : ウィキペディア英語版 | Fast folding algorithm In signal processing, the fast folding algorithm (Staelin, 1969) is an efficient algorithm for the detection of approximately-periodic events within time series data. It computes superpositions of the signal modulo various window sizes simultaneously. The FFA is best known for its use in the detection of pulsars, as popularised by SETI@home and Astropulse. ==See also==
* Pulsar
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Fast folding algorithm」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|